Cryptographically resilient functions

نویسندگان

  • Xian-Mo Zhang
  • Yuliang Zheng
چکیده

This paper studies resilient functions which have applications in fault-tolerant distributed computing , quantum cryptographic key distribution and random sequence generation for stream ciphers. We present a number of methods for synthesizing resilient functions. An interesting aspect of these methods is that they are applicable both to linear and to nonlinear resilient functions. Our second major contribution is to show that every linear resilient function can be transformed into a large number of nonlinear resilient functions with the same parameters. As a result, we obtain resilient functions that are highly nonlinear and have a high algebraic degree.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptographically Resilient Functions - Information Theory, IEEE Transactions on

This correspondence studies resilient functions which have applications in fault-tolerant distributed computing, quantum cryptographic key distribution, and random sequence generation for stream ciphers. We present a number of new methods for synthesizing resilient functions. An interesting aspect of these methods is that they are applicable both to linear and nonlinear resilient functions. Our...

متن کامل

Construction of Cryptographically Important Boolean Functions

Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean function is said to be correlation immune if its output leaks no information about its input values. Balanced correlation immune functions are called resilient functions. Finding methods for easy construction of resilient functions with additional properties is an active research area. Maitra and Pa...

متن کامل

Balanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity

In this paper, we present a class of 2k-variable balanced Boolean functions and a class of 2k-variable 1-resilient Boolean functions for an integer k ≥ 2, which both have the maximal algebraic degree and very high nonlinearity. Based on a newly proposed conjecture by Tu and Deng, it is shown that the proposed balanced Boolean functions have optimal algebraic immunity and the 1-resilient Boolean...

متن کامل

A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction

Thanks to a new upper bound, we study more precisely the nonlinearities of Maiorana-McFarland’s resilient functions. We characterize those functions with optimum nonlinearities and we give examples of functions with high nonlinearities. But these functions have a peculiarity which makes them potentially cryptographically weak. We study a natural super-class of Maiorana-McFarland’s class whose e...

متن کامل

Construction of Nonlinear Boolean Functions with Important Cryptographic Properties

This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, there are infinitely many integers n (both odd and even), such that it is possible to construct n-variable, m-resilient functions having nonlinearity greater than 2− 2 n 2 . Also we obtain better results than all published works on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 43  شماره 

صفحات  -

تاریخ انتشار 1997